Fractal property of the graph homomorphism order
نویسندگان
چکیده
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this “fractal” property contributes to the spectacular properties of the homomorphism order. We first show the fractal property by using Sparse Incomparability Lemma and then by a more involved elementary argument.
منابع مشابه
Analysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension
Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...
متن کاملFinite Homomorphism-Homogeneous Permutations via Edge Colourings of Chains
A relational structure is homomorphism-homogeneous if any homomorphism between its finite substructures extends to an endomorphism of the structure in question. In this note, we characterise all permutations on a finite set enjoying this property. To accomplish this, we switch from the more traditional view of a permutation as a set endowed with two linear orders to a different representation b...
متن کاملThere Is No Finite-infinite Duality Pair - Forming Antichains - in the Digraph Poset
Let D denote the partially ordered sets of homomorphism classes of finite directed graphs, ordered by the homomorphism relation. Order theoretic properties of this poset have been studied extensively, and have interesting connections to familiar graph properties and parameters. This paper studies the generalized duality pairs in D: it gives a new, short proof for the Foniok Nešetřil Tardif theo...
متن کاملFractal Dimension of Graphs of Typical Continuous Functions on Manifolds
If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.
متن کاملHomomorphisms in Graph Property Testing - A Survey
Property-testers are fast randomized algorithms for distinguishing between graphs (and other combinatorial structures) satisfying a certain property, from those that are far from satisfying it. In many cases one can design property-testers whose running time is in fact independent of the size of the input. In this paper we survey some recent results on testing graph properties. A common thread ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 66 شماره
صفحات -
تاریخ انتشار 2017